Adaptive Niching Via Coevolutionary Sharing
نویسندگان
چکیده
An adaptive niching scheme called coevolutionary shared niching (CSN) is proposed, implemented, analyzed and tested. The scheme overcomes the limitations of xed sharing schemes by permitting the locations and radii of niches to adapt to complex landscapes, thereby permitting a better distribution of solutions in problems with many badly spaced optima. The scheme takes its inspiration from the model of monopolistic competition in economics and utilizes two populations, a population of businessmen and a population of customers, where the locations of the businessmen correspond to niche locations and the locations of customers correspond to solutions. Initial results on straightforward test functions validate the distributional e ectiveness of the basic scheme, although tests on a massively multimodal function do not nd the best niches in the allotted time. This result spurs the design of an imprint mechanism that turns the best customers into businessmen, thereby making better use of the search power of the large population of customers. Although additional testing is needed, coevolutionary sharing appears to be a powerful means of controlling the number, location, extent and distribution of solutions in complex landscapes.
منابع مشابه
A Case Study of a Multiobjective Elitist Recombinative Genetic Algorithm with Coevolutionary Sharing
We present a multiobjective genetic algorithm that incorporates various genetic algorithm techniques that have been proven to be efficient and robust in their problem domain. More specifically, we integrate rank based selection, adaptive niching through coevolutionary sharing, elitist recombination, and non-dominated sorting into a multiobjective genetic algorithm called ERMOCS. As a proof of c...
متن کاملCoevolutionary Genetic Algorithms to Simulate the Immune System's Gene Libraries Evolution
Two binary-encoded models describing some aspects of the coevolution between an artificial immune system and a set of antigens have been proposed and analyzed. The first model has focused on the coevolution between antibodies generating gene libraries and antigens. In the second model, the coevolution involves a new population of self molecules whose function was to establish restrictions in th...
متن کاملA Co-evolutionary Multi-agent System for Multi-modal Function Optimization
Niching methods for evolutionary algorithms are used in order to locate all desired peaks of multi-modal landscape. Co-evolutionary techniques are aimed at overcoming limited adaptive capacity of evolutionary algorithms resulting from the loss of useful diversity of population. In this paper the idea of niching co-evolutionary multi-agent system (NCoEMAS) is introduced. In such a system the nic...
متن کاملImplicit Niching in a Learning Classi er
We approach the diicult task of analyzing the complex behavior of even the simplest learning classi-er system (LCS) by isolating one crucial subfunction in the LCS learning algorithm: covering through niching. The LCS must maintain a population of diverse rules that together solve a problem (e.g., classify examples). To maintain a diverse population while applying the GA's selection operator, t...
متن کاملUsing Genetic Algorithms to Study the Evolution of Paratopes and Antibodies in Artificial Immune Systems
Two binary-encoded models describing some aspects of the evolution in an artificial immune system have been proposed and analyzed. The first model has focused on the evolution of a paratope's population, considering a fixed group of epitopes, to simulate a hypermutation mechanism and observe how the system would self-adjust to cover the epitopes. In the second model, the evolution involves a gr...
متن کامل